Knowledge discovery in inductive databases (4th international workshop, KDID 2005, Porto, Portugal, October 3, 2005)Bonchi, Francesco; Boulicaut, Jean-François.Lecture notes in computer science. 2006, issn 0302-9743, isbn 3-540-33292-8, 1Vol, VIII-250 p, isbn 3-540-33292-8Conference Proceedings

Extraction de motifs dans les bases de donnéesBOULICAUT, Jean-François; CREMILLEUX, Bruno.Ingénierie des systèmes d'information (2001). 2004, Vol 9, Num 3-4, issn 1633-1311, 240 p.Serial Issue

A survey on condensed representations for frequent setsCALDERS, Toon; RIGOTTI, Christophe; BOULICAUT, Jean-Francois et al.Lecture notes in computer science. 2006, pp 64-80, issn 0302-9743, isbn 3-540-31331-1, 1Vol, 17 p.Conference Paper

Boolean property encoding for local set pattern discovery : An application to gene expression data analysisPENSA, Ruggero G; BOULICAUT, Jean-Francois.Lecture notes in computer science. 2005, pp 115-134, issn 0302-9743, isbn 3-540-26543-0, 20 p.Conference Paper

Vers une programmation grammaticale à large spectre. Application à la construction de programmes avec le métacompilateur STARLET/GL = Toward a wide spectrum grammatical programming framework. Application to program construction withe the STARLET/GL compiler compilerBoulicaut, Jean-François; Frecon, Louis.1992, 320 p.Thesis

Constraint-based mining and inductive databases (European Workshop on Inductive Databases and Constraint Based Mining)Boulicaut, Jean-François; De Raedt, Luc; Mannila, Heikki et al.Lecture notes in computer science. 2006, issn 0302-9743, isbn 3-540-31331-1, 1Vol, X-399 p, isbn 3-540-31331-1Conference Proceedings

Mining databases and data streams with query languages and rulesZANIOLO, Carlo.Lecture notes in computer science. 2006, pp 24-37, issn 0302-9743, isbn 3-540-33292-8, 1Vol, 14 p.Conference Paper

Transaction databases, frequent itemsets, and their condensed representationsMIELIKÄINEN, Taneli.Lecture notes in computer science. 2006, pp 139-164, issn 0302-9743, isbn 3-540-33292-8, 1Vol, 26 p.Conference Paper

Experiment databases : A novel methodology for experimental researchBLOCKEEL, Hendrik.Lecture notes in computer science. 2006, pp 72-85, issn 0302-9743, isbn 3-540-33292-8, 1Vol, 14 p.Conference Paper

Application-independent feature construction based on almost-closedness propertiesGAY, Dominique; SELMAOUI-FOLCHER, Nazha; BOULICAUT, Jean-François et al.Knowledge and information systems (Print). 2012, Vol 30, Num 1, pp 87-111, issn 0219-1377, 25 p.Article

Découverte de motifs fréquents dans les bases de données : Un cadre formel pour les méthodes = Frequent pattern mining: a formal frame for the methodsRIOULT, Francois.Ingénierie des systèmes d'information (2001). 2004, Vol 9, Num 3-4, pp 211-240, issn 1633-1311, 30 p.Article

To see the wood for the trees : Mining frequent tree patternsBRINGMANN, Björn.Lecture notes in computer science. 2006, pp 38-63, issn 0302-9743, isbn 3-540-31331-1, 1Vol, 26 p.Conference Paper

Local pattern detection and clustering : Are there substantive differences?HÖPPNER, Frank.Lecture notes in computer science. 2005, pp 53-70, issn 0302-9743, isbn 3-540-26543-0, 18 p.Conference Paper

Constraint-based mining of fault-tolerant patterns from boolean dataBESSON, Jérémy; PENSA, Ruggero G; ROBARDET, Céline et al.Lecture notes in computer science. 2006, pp 55-71, issn 0302-9743, isbn 3-540-33292-8, 1Vol, 17 p.Conference Paper

Learning with local modelsRÜPING, Stefan.Lecture notes in computer science. 2005, pp 153-170, issn 0302-9743, isbn 3-540-26543-0, 18 p.Conference Paper

Knowledge-based sampling for subgroup discoverySCHOLZ, Martin.Lecture notes in computer science. 2005, pp 171-189, issn 0302-9743, isbn 3-540-26543-0, 19 p.Conference Paper

Contribution to gene expression data analysis by means of set pattern miningPENSA, Ruggero G; BESSON, Jérémy; ROBARDET, Céline et al.Lecture notes in computer science. 2006, pp 328-347, issn 0302-9743, isbn 3-540-31331-1, 1Vol, 20 p.Conference Paper

Undirected exception rule discovery as local pattern detectionSUZUKI, Einoshin.Lecture notes in computer science. 2005, pp 207-216, issn 0302-9743, isbn 3-540-26543-0, 10 p.Conference Paper

Knowledge discovery in databases : PKDD 2004 (Pisa, 20-24 September 2004)Boulicaut, Jean-François; Esposito, Floriana; Giannotti, Fosca et al.Lecture notes in computer science. 2004, issn 0302-9743, isbn 3-540-23108-0, XIX, 560 p, isbn 3-540-23108-0Conference Proceedings

Exploiting virtual patterns for automatically pruning the search spaceSOULET, Arnaud; CREMILLEUX, Bruno.Lecture notes in computer science. 2006, pp 202-221, issn 0302-9743, isbn 3-540-33292-8, 1Vol, 20 p.Conference Paper

Quick inclusion-exclusionCALDERS, Toon; GOETHALS, Bart.Lecture notes in computer science. 2006, pp 86-103, issn 0302-9743, isbn 3-540-33292-8, 1Vol, 18 p.Conference Paper

From local to global patterns : Evaluation issues in rule learning algorithmsFÜRNKRANZ, Johannes.Lecture notes in computer science. 2005, pp 20-38, issn 0302-9743, isbn 3-540-26543-0, 19 p.Conference Paper

The hows, whys, and whens of constraints in itemset and rule discoveryBAYARDO, Roberto J.Lecture notes in computer science. 2006, pp 1-13, issn 0302-9743, isbn 3-540-31331-1, 1Vol, 13 p.Conference Paper

Towards fault-tolerant formal concept analysisPENSA, Ruggero G; BOULICAUT, Jean-Francois.Lecture notes in computer science. 2005, pp 212-223, issn 0302-9743, isbn 3-540-29041-9, 12 p.Conference Paper

Using constraints during set mining: should we prune or not?BOULICAUT, Jean-Francois; JEUDY, Baptiste.BDA 2000 : bases de données avancées. Journées. 2000, pp 221-237Conference Paper